Two families of graphs that are Cayley on nonisomorphic groups

نویسندگان

چکیده

A number of authors have studied the question when a graph can be represented as Cayley on more than one nonisomorphic group. The work to date has focussed few special situations: groups are $p$-groups; order $pq$; graphs normal; or both abelian. In this paper, we construct two infinite families graphs, each which is an abelian group and nonabelian These include smallest examples such that had not appeared in other results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphic Cayley graphs on nonisomorphic groups

The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.

متن کامل

Digraphs with Small Automorphism Groups That Are Cayley on Two Nonisomorphic Groups

Let Γ = Cay(G,S) be a Cayley digraph on a group G and let A = Aut(Γ). The Cayley index of Γ is |A : G|. It has previously been shown that, if p is a prime, G is a cyclic p-group and A contains a noncyclic regular subgroup, then the Cayley index of Γ is superexponential in p. We present evidence suggesting that cyclic groups are exceptional in this respect. Specifically, we establish the contras...

متن کامل

On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

متن کامل

On two-dimensional Cayley graphs

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

متن کامل

On the eigenvalues of Cayley graphs on generalized dihedral groups

‎Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$‎. ‎Then the energy of‎ ‎$Gamma$‎, ‎a concept defined in 1978 by Gutman‎, ‎is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$‎. ‎Also‎ ‎the Estrada index of $Gamma$‎, ‎which is defined in 2000 by Ernesto Estrada‎, ‎is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$‎. ‎In this paper‎, ‎we compute the eigen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of algebra combinatorics discrete structures and applications

سال: 2021

ISSN: ['2148-838X']

DOI: https://doi.org/10.13069/jacodesmath.867644